Note on Shortest and Nearest Lattice Vectors
نویسنده
چکیده
K is a centrally symmetric convex body with nonempty interior and fK(·) is also called the distance function of K because fK(x) = min{ρ ∈ R≥0 : x ∈ ρK}. The Euclidean norm is denoted by fB(·), where B is the n-dimensional unit ball, and the associated inner product is denoted by 〈·, ·〉. Finally, we denote by C the cube with edge length 2 and center 0, and thus fC(·) denotes the maximum norm. As usual we denote by dxe the smallest integer not less than x ∈ R.
منابع مشابه
Faster tuple lattice sieving using spherical locality-sensitive filters
To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai–Laarhoven–Stehlé [ANTS 2016] studied tuple lattice sieving, where tuples instead of pairs of lattice vectors are combined to form shorter vectors. Herold–Kirshanova [PKC 2017] recently improved upon their results for arbitrary tuple sizes, for example showing that a triple sie...
متن کاملSpeeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search
We give a simple heuristic sieving algorithm for the m-dimensional exact shortest vector problem (SVP) which runs in time 2. Unlike previous time-memory trade-offs, we do not increase the memory, which stays at its bare minimum 2. To achieve this complexity, we borrow a recent tool from coding theory, known as nearest neighbor search for binary code words. We simplify its analysis, and show tha...
متن کاملA short note on the kissing number of the lattice in Gaussian wiretap coding
We show that on an n = 24m+ 8k-dimensional even unimodular lattice, if the shortest vector length is ≥ 2m, then as the number of vectors of length 2m decreases, the secrecy gain increases. We will also prove a similar result on general unimodular lattices. Furthermore, assuming the conjecture by Belfiore and Solé, we will calculate the difference between inverses of secrecy gains as the number ...
متن کاملOn Free Planes in Lattice Ball Packings
This note, by studying relations between the length of the shortest lattice vectors and the covering minima of a lattice, mainly proves that for every d-dimensional packing lattice of balls one can find a 4-dimensional plane, parallel to a lattice plane, such that the plane meets none of the balls of the packing, provided the dimension d is large enough. On the other hand, we show that for cert...
متن کاملApproximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors
We show that given oracle access to a subroutine which returns approximate closest vectors in a lattice, one may find in polynomial time approximate shortest vectors in a lattice. The level of approximation is maintained; that is, for any function f , the following holds: Suppose that the subroutine, on input a lattice L and a target vector w (not necessarily in the lattice), outputs v ∈ L such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 61 شماره
صفحات -
تاریخ انتشار 1997